Nonlinear least-squares fitting of first-order rate coefficients (comparison between the Gauss-Seidel method and Swain's KORE program)
نویسندگان
چکیده
منابع مشابه
Determination of the best-fitting reference orbit for a LEO satellite using the Lagrange coefficients
Linearization of the nonlinear equations and iterative solution is the most well-known scheme in many engineering problems. For geodetic applications of the LEO satellites, e.g. the Earth’s gravity field recovery, one needs to provide an initial guess of the satellite location or the so-called reference orbit. Numerical integration can be utilized for generating the reference orbit if a satelli...
متن کاملApproximate Gauss-Newton Methods for Nonlinear Least Squares Problems
The Gauss–Newton algorithm is an iterative method regularly used for solving nonlinear least squares problems. It is particularly well suited to the treatment of very large scale variational data assimilation problems that arise in atmosphere and ocean forecasting. The procedure consists of a sequence of linear least squares approximations to the nonlinear problem, each of which is solved by an...
متن کاملComparison results on the preconditioned mixed-type splitting iterative method for M-matrix linear systems
Consider the linear system Ax=b where the coefficient matrix A is an M-matrix. In the present work, it is proved that the rate of convergence of the Gauss-Seidel method is faster than the mixed-type splitting and AOR (SOR) iterative methods for solving M-matrix linear systems. Furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a preconditio...
متن کاملGauss-Seidel Iterative Methods for Rank Deficient Least Squares Problems
We study the semiconvergence of Gauss-Seidel iterative methods for the least squares solution of minimal norm of rank deficient linear systems of equations. Necessary and sufficient conditions for the semiconvergence of the Gauss-Seidel iterative method are given. We also show that if the linear system of equations is consistent, then the proposed methods with a zero vector as an initial guess ...
متن کاملThe University of Reading Approximate Gauss-Newton methods for nonlinear least squares problems
The Gauss-Newton algorithm is an iterative method regularly used for solving nonlinear least squares problems. It is particularly well-suited to the treatment of very large scale variational data assimilation problems that arise in atmosphere and ocean forecasting. The procedure consists of a sequence of linear least squares approximations to the nonlinear problem, each of which is solved by an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Chemistry
دوره 9 شماره
صفحات -
تاریخ انتشار 1985